CCS, Locations and Asynchronous Transition Systems
نویسندگان
چکیده
منابع مشابه
CCS , Locations and Asynchronous Transition
Our aim is to provide a simple non-interleaved operational semantics for CCS in terms of a model that is easy to understand|asynchronous transition systems. Our approach is guided by the requirement that the semantics should identify the concurrency present in the system in a natural way, in terms of events occurring at independent locations in the system. We extend the standard interleaving tr...
متن کاملComparing Transition Systems with Independence and Asynchronous Transition Systems
Transition systems with independence and asynchronous transition systems are noninterleaving models for concurrency arising from the same simple idea of decorating transitions with events. They differ for the choice of a derived versus a primitive notion of event which induces considerable differences and makes the two models suitable for different purposes. This opens the problem of investigat...
متن کاملComparing Transition Systems with Independenceand Asynchronous Transition
Transition systems with independence and asynchronous transition systems are noninterleaving models for concurrency arising from the same simple idea of decorating transitions with events. They diier for the choice of a derived versus a primitive notion of event which induces considerable diierences and makes the two models suitable for diierent purposes. This opens the problem of investigating...
متن کاملCCS semantics via proved transition systems and rewriting logic
We consider (a slight variant of) the ccs calculus, and we analyze two operational semantics deened in the literature: the rst exploits Proved Transition Systems (pts) and the second Rewriting Logic (rl). We show that the interleaving interpretation of both semantics agree, in that they deene the same transitions and exhibit the same nondeterministic structure. In addition, we study causality i...
متن کاملUniversit at Augsburg Concurrent Implementation of Asynchronous Transition Systems Concurrent Implementation of Asynchronous Transition Systems
The synthesis problem is to decide for a deterministic transition system whether a Petri net with an isomorphic reachability graph exists and in case to nd such a net (which must have the arc-labels of the transition system as transitions). In this paper, we weaken isomorphism to some form of bisimilarity that also takes concurrency into account and we consider safe nets that may have additiona...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DAIMI Report Series
سال: 1992
ISSN: 2245-9316,0105-8517
DOI: 10.7146/dpb.v21i395.6630